Ramsey theory without pigeonhole principle and the adversarial Ramsey principle
نویسندگان
چکیده
منابع مشابه
An Exact Ramsey Principle for Block Sequences
We prove an exact, i.e., formulated without ∆-expansions, Ramsey principle for infinite block sequences in vector spaces over countable fields where the two sides of the dichotomic principle are represented by respectively winning strategies in Gowers’ block sequence game and winning strategies in the infinite asymptotic game. This allows us to recover Gowers’ dichotomy theorem for block sequen...
متن کاملThe Pigeonhole Principle
Theorem 1.1. If n + 1 objects are put into n boxes, then at least one box contains two or more objects. Proof. Trivial. Example 1.1. Among 13 people there are two who have their birthdays in the same month. Example 1.2. There are n married couples. How many of the 2n people must be selected in order to guarantee that one has selected a married couple? Other principles related to the pigeonhole ...
متن کاملFrom the pigeon hole principle to topological Ramsey spaces
This is a talk about the development of Ramsey theory, from combinatorial results like the classical pigeon hole principle, Ramsey’s theorem [14] and Hindman’s theorem [8], making emphasis in the notion of topological Ramsey space. In [6], Ellentuck gave a characterization of the Ramsey property which gave rise to the topological Ramsey theory. It was anticipated by the works of Nash-Williams [...
متن کاملA transference principle for Ramsey numbers of bounded degree graphs
We investigate Ramsey numbers of bounded degree graphs and provide an interpolation between known results on the Ramsey numbers of general bounded degree graphs and bounded degree graphs of small bandwidth. Our main theorem implies that there exists a constant c such that for every ∆, there exists β such that if G is an n-vertex graph with maximum degree at most ∆ having a homomorphism f into a...
متن کاملPigeonhole Principle and the Probabilistic Method
As a story, this means that at a party with n persons, there exist two persons who know the same number of people at the party. Proof. For any graph on n vertices, the degrees are integers between 0 and n − 1. Therefore, the only way all degrees could be different is that there is exactly one vertex of each possible degree. In particular, there is a vertex v of degree 0 (with no neighbors) and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2020
ISSN: 0002-9947,1088-6850
DOI: 10.1090/tran/8063